Optimistic optimization for continuous nonconvex piecewise affine functions∗
نویسندگان
چکیده
This paper considers the global optimization problem of a continuous nonconvex piecewise affine (PWA) function over a polytope. This type of optimization problem often arises in the context of control of continuous PWA systems. In literature, it has been shown that the given problem can be formulated as a mixed integer linear programming problem, the worst-case complexity of which grows exponentially with the number of polyhedral subregions in the domain of the PWA function. In this paper, we propose a solution approach that is more efficient for continuous PWA functions with a large number of polyhedral subregions. The proposed approach is founded on optimistic optimization, which is based on hierarchical partitioning of the feasible set and which focuses on the most promising region when searching for the global optimum. The advantage of optimistic optimization is that one can guarantee bounds on the suboptimality with respect to the global optimum given a finite computational budget (e.g. the number of iterations). In particular, the gap between the best value returned by the proposed algorithm and the real optimum can be made arbitrarily small as the computational budget increases. We derive the analytic expressions for the core parameters required by optimistic optimization for continuous PWA functions. The efficiency of the resulting algorithm is illustrated with numerical examples.
منابع مشابه
Enlarging Domain of Attraction for a Special Class of Continuous-time Quadratic Lyapunov Function Piecewise Affine Systems based on Discontinuous Piecewise
This paper presents a new approach to estimate and to enlarge the domain of attraction for a planar continuous-time piecewise affine system. Various continuous Lyapunov functions have been proposed to estimate and to enlarge the system’s domain of attraction. In the proposed method with a new vision and with the aids of a discontinuous piecewise quadratic Lyapunov function, the domain of attrac...
متن کاملComputing proximal points of nonconvex functions
The proximal point mapping is the basis of many optimization techniques for convex functions. By means of variational analysis, the concept of proximal mapping was recently extended to nonconvex functions that are prox-regular and prox-bounded. In such a setting, the proximal point mapping is locally Lipschitz continuous and its set of fixed points coincide with the critical points of the origi...
متن کاملA DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
We introduce an algorithm to minimize a function of several variables with no convexity nor smoothness assumptions. The main peculiarity of our approach is the use of an the objective function model which is the difference of two piecewise affine convex functions. Bundling and trust region concepts are embedded into the algorithm. Convergence of the algorithm to a stationary point is proved.
متن کاملAn effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients
متن کامل
An algorithm for the estimation of a regression function by continuous piecewise linear functions
The problem of the estimation of a regression function by continuous piecewise linear functions is formulated as a nonconvex, nonsmooth optimization problem. Estimates are defined by minimization of the empirical L2 risk over a class of functions, which are defined as maxima of minima of linear functions. An algorithm for finding continuous piecewise linear functions is presented. We observe th...
متن کامل